A tight bound on the speed-up through storage for quickest multi-commodity flows
نویسندگان
چکیده
Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO 2002) show that the speed-up through storage is at most a factor of 2, and that there are instances where the speed-up is as large as a factor of 4/3. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to 2.
منابع مشابه
Quickest Flows Over Time
Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic to...
متن کاملMulti-commodity Multimodal Splittable Logistics Hub Location Problem with Stochastic Demands
This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملDistribution and storage of data on local and remote disks in multi-use clusters of commodity PCs
Over the last few decades, the power of personal computers (PCs) has grown steadily, following the exponential growth rate predicted by Moore’s law. The trend towards the commoditization of PC components (such as CPUs, memories, high-speed interconnects and disks) results in a highly attractive price/performance ratio of the systems built from those components. Following these trends, I propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 43 شماره
صفحات -
تاریخ انتشار 2015